A note on walk entropies in graphs

نویسنده

  • Michele Benzi
چکیده

Article history: Received 15 November 2013 Accepted 9 December 2013 Available online 27 December 2013 Submitted by R. Brualdi MSC: 05C50 15A16 82C20

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete-Time Quantum Walks and Graph Structures

We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total entropies of the average mixing matrices for some cubic graphs. The trace captures how likely a quantum walk is to revisit the state it started with, and the...

متن کامل

Walk entropies in graphs

Article history: Received 25 October 2013 Accepted 9 November 2013 Available online 25 November 2013 Submitted by R. Brualdi MSC: 05C50 05C81 05C76

متن کامل

A NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS

The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.

متن کامل

A Graph Embedding Method Using the Jensen-Shannon Divergence

Riesen and Bunke recently proposed a novel dissimilarity based approach for embedding graphs into a vector space. One drawback of their approach is the computational cost graph edit operations required to compute the dissimilarity for graphs. In this paper we explore whether the Jensen-Shannon divergence can be used as a means of computing a fast similarity measure between a pair of graphs. We ...

متن کامل

Non - Amenable Cayley Graphs of High Girth

In this note we show that percolation on non-amenable Cayley graphs of high girth has a phase of non-uniqueness, i.e., pc < pu . Furthermore, we show that percolation and self-avoiding walk on such graphs have mean-field critical exponents. In particular, the self-avoiding walk has positive speed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013